| 1. | As applications of succeeding , numerical examples of max - cut and vertex cover are given
数值实验表明这种算法是求解较大规模半定规划问题的有效方法 |
| 2. | The simulation results show that the novel algorithm is more scalable than the traditional algorithms , and can find smaller weak vertex cover
仿真结果表明，比较现有算法，新算法能找出更小的弱顶点覆盖集，具有更好的可扩展性。 |
| 3. | But the classical vertex cover algorithm can not use in the cbvc problem directly , because the cbvc problem have more term need to constraint
但是，以上的算法并不能直接应用于受二分图约束的顶点覆盖问题( constraintbipartitevertexcover , cbvc )求解。 |
| 4. | A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper , which can be used for monitor - nodes selection in net traffic measurement
摘要提出了一种分布式求解弱顶点覆盖集的近似算法，用于网络流量有效测量点的选择。 |
| 5. | Che [ 1 ] proposed a heuristic fault spectrum algorithm that solves the cbvc problem very efficient but still not guarantee the minimization of the set of vertex cover
Che在此前也曾提出过一种基于启发式的错误谱算法[ 1 ] ，有效提高了求解的效率。但该算法仍然存在不能保证最优解的问题。 |
| 6. | But this algorithm do not guarantee the minimization of the set of vertex cover , which mean while do not guarantee it can be fixed that all of fault chips which should be fixed
但该算法的缺点在于不能保证求出顶点覆盖的最优解。也就是说，当一片芯片在事实上是可修复时却有可能在近似算法中得到不可修复的结论。 |
| 7. | This problem was first studied by n . hasan and c . l . liu in [ 5 ] , and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem . hasan and liu proposed two algorithms that solves the cbvc problem
另外， kuo和fuchs还对如何修复给出了两个算法：一个是近似算法，到目前为止，该算法仍然是最高效的顶点覆盖问题的求解算法之一。 |
| 8. | Also with the help of graph rewriting , a new decision selection algorithm is proposed . this algorithm takes advantage of the weighted vertex cover algorithm , finds the vertexes with different color , and puts the minimum one into the group of chosen by sequence
同时,利用图重写规则实现了一个决策选择算法:采用图的最小顶点覆盖集合的算法,首先通过图着色找出着色相异的顶点,依次将可以使系统效益最大化的决策点加入到决策集合中。 |
